MATHEMATICAL ENGINEERING TECHNICAL REPORTS A Strongly Polynomial Algorithm for Line Search in Submodular Polyhedra
نویسنده
چکیده
A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization as a subroutine. The algorithm is based on the parametric search method proposed by Megiddo.
منابع مشابه
A strongly polynomial algorithm for line search in submodular polyhedra
A submodular polyhedron is a polyhedron associated with a submodular function. This paper presents a strongly polynomial time algorithm for line search in submodular polyhedra with the aid of a fully combinatorial algorithm for submodular function minimization. The algorithm is based on the parametric search method proposed by Megiddo.
متن کاملDiscrete Newton's Algorithm for Parametric Submodular Function Minimization
We consider the line search problem in a submodular polytope P (f) ⊆ R: Given an arbitrary a ∈ R and x0 ∈ P (f), compute max{δ : x0 + δa ∈ P (f)}. The use of the discrete Newton’s algorithm for this line search problem is very natural, but no strongly polynomial bound on its number of iterations was known [Iwata, 2008]. We solve this open problem by providing a quadratic bound of n + O(n log n)...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملBisubmodular Function Minimization
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to Iwata, Fleischer, and Fujishige. Since the rank functions of delta-matroids are bisubmodular, the scaling algorithm naturally leads to the first combinatorial polynomial algorithm for testing membership in delta-matro...
متن کاملA faster capacity scaling algorithm for minimum cost submodular flow
We describe an O(nhmin{logU, n log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds–Karp capacity scaling algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter δ. Capacities are relaxed by attaching a complete directed graph with uniform...
متن کامل